Priority Operators for Fairshare Scheduling
نویسندگان
چکیده
Decentralized prioritization is a technique to influence job scheduling order in grid fairshare scheduling without centralized control. The technique uses an algorithm that measures individual user distances between quota allocations and historical resource usage (intended and current system state) to establish a semantic for prioritization. In this work we address design and evaluation of priority operators, mathematical functions to determine such distances. We identify desirable operator characteristics, establish a methodology for operator evaluation, and evaluate a set of proposed operators for the algorithm.
منابع مشابه
Decentralized scalable fairshare scheduling
This work addresses Grid fairshare allocation policy enforcement and presents Aequus, a decentralized system for Grid-wide fairshare job prioritization. The main idea of fairshare scheduling is to prioritize users with regard to predefined resource allocation quotas. The presented system builds on three contributions; a flexible tree-based policy model that allows delegation of policy definitio...
متن کاملDecentralized, Scalable, Grid Fairshare Scheduling (FSGrid)
This work addresses Grid fairshare allocation policy enforcement and presents FSGrid, a decentralized system for Grid-wide fairshare job prioritization. The presented system builds on three contributions; a flexible tree-based policy model that allows delegation of policy definition, a job prioritization algorithm based on local enforcement of distributed fairshare policies, and a decentralized...
متن کاملWeighted Earliest Deadline Scheduling and Its Analytical Solution for Admission Control in a Wireless Emergency Network∗
For wireless networks operating during emergency conditions, emergency, handoff, and new calls are the main kinds of demand. Different operators will have different policies about which should have higher priority, and how to implement that kind of priority. This paper focuses on applying queuing methods for admission control for the above three types of calls. A Weighted Earliest Deadline sche...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملA Discrete Particle Swarm Optimization with Combined Priority Dispatching Rules for Hybrid Flow Shop Scheduling Problem
In this paper, an algorithm based on particle swarm optimization is proposed, for hybrid flow shop scheduling problem, to minimize the makespan. First an effective new approach using two decisions based on parallel priority dispatching rules is applied. Next we develop an hybridizing DPSO, that presents new components to updating velocity and position using genetic operators, with an adaptive n...
متن کامل